1·Traveling salesman problem(TSP) is a NP complete combinatorial optimum problem.
旅行商问题是NP完全的组合优化问题。
2·The problem of sequence planning can be translated into Traveling Salesman Problem (TSP).
序列规划问题一般转化为旅行商问题来求解。
3·Traveling Salesman problem (TSP) is a classic combinatorial optimization problem and NP-hard.
旅行商问题是一个经典的组合优化问题，也是一个NP难问题。
4·Neural Network with Transient Chaos (TCNN) can be used to solve the Traveling Salesman Problem (TSP).
具有瞬态混沌特性的神经网络(TCNN)可以解tsp。
5·It has been paid much attention to since the successful application in the famous traveling salesman problem.
自从在旅行商等著名问题中得到富有成效的应用之后，已引起人们越来越多的关注和重视。
6·This paper presents some approaches to the application of Genetic Algorithms to the Traveling Salesman Problem.
本文提出了一些对遗传算法应用于旅行商问题的方法。
7·Traveling Salesman Problem(TSP) is a classic combined optimization problem and it is proved that TSP is NP hard.
TSP（旅行商）问题作为经典的组合优化问题，已经被证明是一个NP难题。
8·We present an algorithm about Traveling Salesman problem through the method of Self saturated Subscript in Cycle.
通过圈上结点下标自足方法，给出了一个关于旅行推销员问题的算法。
9·Traveling salesman problem(TSP) and nonlinear equations are two kinds of important problems with widely applications.
旅行商问题（TSP）和非线性方程组都是具有广泛的应用背景的重要问题。
10·Experimental results on Traveling Salesman Problem (TSP) demonstrate that the proposed algorithm is viable and efficient.
以旅行商问题(TSP)作为算例，实验结果验证了新算法的有效性和高效性。